Irreducible polynomials and linear recurring arrays

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Recurring m-Arrays

In this paper, the properties, structures and translation equivalence relations of linear recurring m-arrays are systematically studied. The number of linear recurring m-arrays is given. 1. Intrduction Reed and Steward [ll], Spann [5] and [2] have studied the arrays of so-called perfact maps. This has ied I IO research on various types of window properties for arrays(see [2]-[11]). In this pape...

متن کامل

Roots and Irreducible Polynomials

This handout, which accompanies the course on analogies between Z and F [T ], discusses some properties of polynomials in F [T ]. The results in Sections 1 and 2 work with any F , but the results in Section 3 and 4 are (somewhat) special to the field F = Fp. The main result in these notes in Theorem 3.7. The notation F [T ]h(T ), for the ring of polynomials in F [T ] considered modulo h(T ), is...

متن کامل

Prime Numbers and Irreducible Polynomials

The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry. There are certain conjectures indicating that the connection goes well beyond analogy. For example, there is a famous conjecture of Buniakowski formulated in 1854 (see Lang [3, p. 323]), independently reformulated by Schinzel, to the effect that ...

متن کامل

Irreducible Polynomials over Finite Fields

As we will see, modular arithmetic aids in testing the irreducibility of polynomials and even in completely factoring polynomials in Z[x]. If we expect a polynomial f(x) is irreducible, for example, it is not unreasonable to try to find a prime p such that f(x) is irreducible modulo p. If we can find such a prime p and p does not divide the leading coefficient of f(x), then f(x) is irreducible ...

متن کامل

Invariants of Defectless Irreducible Polynomials

Defectless irreducible polynomials over a valued field (F, v) have been studied by means of strict systems of polynomial extensions and complete distinguished chains. Strong connections are developed here between these two approaches and applications made to both. In the tame case where a root α of an irreducible polynomial f generates a tamely ramified extension of (F, v), simple formulas are ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1997

ISSN: 0166-218X

DOI: 10.1016/s0166-218x(96)00112-6